Toward Advocacy-Free Evaluation of Packet Classification Algorithms
نویسندگان
چکیده
منابع مشابه
Packet Classification Algorithms
This paper deals with packet classification in computer networks. Classification is the key task in many networking devices, most notably packet filters – firewalls. This paper therefore concerns the area of computer security. The paper is focused on high-speed networks with the bandwidth of 100Gb/s and beyond. General-purpose processors cannot be used in such cases, because their performance i...
متن کاملAlgorithms for Packet Classification
The process of categorizing packets into “flows” in an Internet router is called packet classification. All packets belonging to the same flow obey a pre-defined rule and are processed in a similar manner by the router. For example, all packets with the same source and destination IP addresses may be defined to form a flow. Packet classification is needed for non “best-effort” services, such as...
متن کاملDynamic Algorithms with Worst-Case Performance for Packet Classification
Packet classi cation involves | given a set of rules | nding the highest priority rule matching an incoming packet. When designing packet classi cation algorithms, three metrics need to be considered: query time, update time and storage requirements. The algorithms proposed to-date have been heuristics that exploit structure inherent in the classi cation rules, and/or trade o one or more metric...
متن کاملA Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic accounting, etc. Various approaches to packet classification have been studied in the literature with accompanying theoretical bounds. Practical studies with results applying to large number of filters (from 8K to 1 milli...
متن کاملTime and Space Efficient Algorithms for Packet Classification and Forwarding
The Internet consists of a mesh of routers (nodes) connected by links (edges) and the tra c through the Internet is divided into flows where each flow is an ordered sequence of packets, or datagrams. Each packet consists of a header and a piece of data, also referred to as payload. The header contains information about source and destination of the packet as well as some additional information....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2011
ISSN: 0018-9340
DOI: 10.1109/tc.2010.252